Coordinating Computation and I/O in Massively Parallel Sequence Search

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Massively parallel neural computation

Reverse-engineering the brain is one of the US National Academy of Engineering’s “Grand Challenges.” The structure of the brain can be examined at many different levels, spanning many disciplines from low-level biology through psychology and computer science. This thesis focusses on real-time computation of large neural networks using the Izhikevich spiking neuron model. Neural computation has ...

متن کامل

A Massively Parallel Sequence Similarity Search for Metagenomic Sequencing Data

Sequence similarity searches have been widely used in the analyses of metagenomic sequencing data. Finding homologous sequences in a reference database enables the estimation of taxonomic and functional characteristics of each query sequence. Because current metagenomic sequencing data consist of a large number of nucleotide sequences, the time required for sequence similarity searches account ...

متن کامل

Efficient, Massively Parallel Eigenvalue Computation

In numerical simulations of disordered electronic systems, one of the most common approaches is to diagonalize random Hamiltonian matrices and to study the eigenvalues and eigenfunctions of a single electron in the presence of a random potential. In this paper, we describe an effort to implement a matrix diagonalization routine for real symmetric dense matrices on massively parallel SIMD comput...

متن کامل

PRA*: Massively Parallel Heuristic Search

In this paper we describe a variant of A* search designed to run on the massively parallel, SIMD Connection Machine (CM-2). The algorithm is designed to run in a limited memory by use of a retraction technique which allows nodes with poor heuristic values to be removed from the open list, until such time as they may need reexpansion, more promising paths having failed. Our algorithm, called PRA...

متن کامل

Massively Parallel Computation of Sti Propagating

In this paper we study the computation of combustion fronts using MIMD architecture. Our applications in gas combustion, solid combustion as well as frontal poly-merization are characterized by stii fronts that propagate with nonlinear dynamics. The multiple scale phenomena under consideration lead to very intense computation. The understanding of the mechanism of instabilities is the goal of o...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: IEEE Transactions on Parallel and Distributed Systems

سال: 2011

ISSN: 1045-9219

DOI: 10.1109/tpds.2010.101